NEW SPARSENESS RESULTS ON GRAPH SPANNERS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Results on Fault Tolerant Geometric Spanners

We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S IRd be a set of n points and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path. Recently it was sho...

متن کامل

Some New Results On the Hosoya Polynomial of Graph Operations

The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...

متن کامل

Constructing Degree-3 Spanners with Other Sparseness Properties

Let V be any set of n points in k-dimensional Euclidean space. A subgraph of the complete Euclidean graph is a t-spanner if for any ~ and ~ in V, the length of the shortest path from u to v in the spanner is at most t times d(~, ~). We show that for any 5 > 1, there exists a polynomial-time constructihle tspanner (where ~ is a constant that depends only on 5 and k) with the following properties...

متن کامل

Dynamic Algorithms for Graph Spanners

Let G = (V, E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. For the graph G, A spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E, such that the distance between any pair of vertices in this subgraph is at most t times the distance between them in the graph G. We present simple and efficient dynamic algorithms for maintaining spanners with essentially optimal (e...

متن کامل

Some results on Bipolar Fuzzy Graph

In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Geometry & Applications

سال: 1995

ISSN: 0218-1959,1793-6357

DOI: 10.1142/s0218195995000088